The Boolean SATisfiability Problem in Clifford algebra
نویسنده
چکیده
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
منابع مشابه
From Satisfiability to Linear Algebra
Satisfiability of boolean formulas (SAT) is an interesting problem for many reasons. It was the first problem proved to be NP-complete by Cook. Efficient SAT solvers have many applications. In fact, there is a huge literature on SAT, and its connections with other optimization problems have been explored. In this paper, we look at SAT using linear algebra, a basic and fundamental mathematics th...
متن کاملA novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two operations: expansion and simplification are used to explains why using algebra grows the resolution steps. It is proved that its complexity has an upper bou...
متن کاملQUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
We describe Qubos (QUantified BOolean Solver), a decision procedure for quantified Boolean logic. The procedure is based on nonclausal simplification techniques that reduce formulae to a propositional clausal form after which off-the-shelf satisfiability solvers can be employed. We show that there are domains exhibiting structure for which this procedure is very effective and we report on exper...
متن کاملDesigning SAT for HCP
For arbitrary undirected graph G, we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The obtained SAT be the logic formulation of conditions for Hamiltonian cycle existence, and use m Boolean variables, where m is the number of graph edges. This Boolean expression is true if and only if an initial graph is Hamiltonian. That is, each satisfying assignment...
متن کاملDerivations on Certain Semigroup Algebras
In the present paper we give a partially negative answer to a conjecture of Ghahramani, Runde and Willis. We also discuss the derivation problem for both foundation semigroup algebras and Clifford semigroup algebras. In particular, we prove that if S is a topological Clifford semigroup for which Es is finite, then H1(M(S),M(S))={0}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.02942 شماره
صفحات -
تاریخ انتشار 2017